" developerworks , november 2003 : this article discusses proper xml structure as well as best and worst practices for defining data validation rules in xml schema ” （ developerworks ， 2003年11月） ：该文讨论了正确的xml结构，以及用xml schema定义数据验证规则最佳实践和最差实践。
Each class in this namespace corresponds to a specific element in the wsdl specification , and the class hierarchy corresponds to the xml structure of a valid wsdl document 此命名空间中的每个类都与wsdl规范中的某个特定元素相对应，并且类的层次结构与有效的wsdl文档的xml结构相对应。
Sometimes the code of a sax document handler can become cumbersome , poorly structured , and difficult to maintain , especially for complex xml structures with many different elements 有时候sax文档处理程序的代码可能变得非常麻烦、结构性差而且难以维护，尤其是对于那些包含多种不同元素的复杂xml结构。
If the value is not a simple data type such as string , integer , and so on then a ws . binder should be specified that is capable of serializing the value into the appropriate xml structure 如果该值不是一个简单数据类型（例如，字符串、整数或其他） ，则应该指定一个能将该值序列化为适当的xml结构的ws . binder 。
The deserialization process , then , boils down to the navigation of the xml structure to identify relevant descendant elements and the subsequent delegation of deserialization responsibilities to more primitive deserializers , as follows 于是，反序列化过程就归结为：先遍历xml结构来识别相关的后代元素，随后将反序列化的责任委托给更基本的反序列化器，如下所示：
Tree - based apis like dom present an in - memory xml structure that is optimal for guis and editors , and stream - based apis like sax are great for high - performance applications that only need to get at a document s data 基于树的api （如dom ）展现了一个内存中的xml结构，该结构对于gui和编辑器来说是最理想的，基于流的api （如sax ）对于只需要获取文档数据的高性能应用程序来说很重要。
Queryoptimization for xml structured - documents stands out as one of the mostchallenging research issues in this area because of the much enlargedoptimization search space , which is a consequence of the intrinsiccomplexity of the underlying data model of xml data 近年来，人们提出了多种xml数据的存贮模型，例如将xml数据映射为关系模型或对象关系模型，或者使用特种数据库如半结构化数据库等来进行管理。
Third , this dissertation analyzes the complicacy of result size estimation problem for xml structure based query optimization compared to its counterpart in traditionally relational database , and proposes a full - featured result size estimation algorithm for xml query , sxm . for simple path expression query , this dissertation proposes a dynamic synopsis model for xml data based on the concept of f - stable and b - stable , xmap . for complicated path expression query , this dissertation adopts an improved bifocal sampling method for result size estimation 第三，分析了xml结构化查询优化中的查询代价估计问题与传统关系型数据库中的查询代价估计问题的区别，提出了一套完整的xml结构化查询代价估计体系sxm ，包括对简单路径表达进行查询代价估计的动态xml数据统计模型xmap ，对复杂路径表达进行查询代价估计的双焦点例举法，以及对值匹配条件进行查询代价估计的基于小波的多维直方图方法，并能将多种查询表达的查询代价估计结果结合在一起，以给出一个完整的xpath查询的代价估计。
( 2 ) this article promotes an idea that applies information compression techniques to xml data format . it puts forward structure guided compression model ( sgcm ) , including algorithms such as xml structure tree spanning based on huffinan coding for element frequency , and sgcmheap generation algorithm . not only common compression techniques are used , structure based compression optimization is also rendered ( 2 )本文提出将信息压缩技术应用于xml ，提出了结构制导的xml压缩模型sgcm ，包括相关的算法，如基于元素出现频度huffman编码的xml结构树生成算法， sgcmheap的生成算法? ?不仅利用了当前通用的部分压缩技术，而且探讨在xml结构的基础上有对其进行压缩优化的可能。
To manage large - scale xml documents with complicated structure , this dissertation focus on the efficient structural indexing algorithm for xml data , result size estimation problem for xml structure based query optimization , result relevance ranking algorithm , and infrastructure for xml query processing for both text - rich and data - rich xml documents . to address the aforementioned issues , this dissertation makes the following contributions . first , it investigates the drawbacks of existing indexing algorithm for xml data , and propose a dynamic indexing algorithm for xml data based on d - bisimilarity , difx 为满足结构复杂、大规模的xml数据管理需要，本文深入研究了xml信息检索系统中的结构索引算法设计和结构化查询优化中的查询代价估计问题，以及查询结果和查询条件间的相关度算法，主要取得了4个方面的成果：第一，分析了已有的xml数据索引算法中存在的问题，提出了一种高效的动态xml结构索引算法difx ，它采用动态后向结构相似性( d - bisimilarity )的概念，可以根据实际查询需求以及索引最优化的要求动态决定索引中保存的结构信息。
